Probabilistic, Temporal Projections in ConGolog

نویسنده

  • Henrik Grosskreutz
چکیده

The ability of mobile robots to project plans, i.e. to predict what will happen when they execute a plan, is crucial to flexibly plan and react in uncertain environments. While classical formalizations of this problem make strong assumptions about the world and restrict robot plans to simple, partially ordered sets of actions, real world robot controllers make use of concurrency, priorities and use probabilistic models. In this paper we present an extension of the situation calculus, representing time, concurrency, probabilistic belief, probabilistic action effects and complex plans, integrating and extending several previous proposal into a single formal framework. We apply this framework to model and reason about the behavior of a mobile service robot.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extending ConGolog to Allow Partial Ordering

In this paper we extend the high level execution language ConGolog (developed at the University of Toronto) by adding to it a new construct which we call the htn-construct. The new construct improves ConGolog by allowing easy specification of non-determinism when a partial ordering between a set of actions needs to be maintained. Furthermore, it allows temporal constraints to be specified easil...

متن کامل

Verifying ConGolog Programs on Bounded Situation Calculus Theories

We address verification of high-level programs over situation calculus action theories that have an infinite object domain, but bounded fluent extensions in each situation. We show that verification of μ-calculus temporal properties against ConGolog programs over such bounded theories is decidable in general. To do this, we reformulate the transition semantics of ConGolog to keep the bindings o...

متن کامل

ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories for Planning and Beyond

ConGolog is a logical programming language for agents that is defined in the situation calculus. ConGolog agent control programs were originally proposed as an alternative to planning, but have also more recently been proposed as a means of providing domain control knowledge for planning. In this paper, we present a compiler that takes a ConGolog program and produces a new basic action theory o...

متن کامل

An Embedding of ConGolog in 3APL

Several high-level programming languages for programming agents and robots have been proposed in recent years. Each of these languages has its own features and merits. It is still difficult, however, to compare different programming frameworks and evaluate the relative benefits and disadvantages of these frameworks. In this paper, we present a general method for comparing agent programming fram...

متن کامل

ConGolog, Sin Trans: Compiling ConGolog into Basic Action Theories

ConGolog is a logical programming language for agents that is defined in the situation calculus. ConGolog agent control programs were originally proposed as an alternative to planning, but have also more recently been proposed as a means of providing domain control knowledge for planning. In this paper, we present a compiler that takes a ConGolog program and produces a new basic action theory o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999